Graph Coloring in University Timetable Scheduling

Addressing scheduling problems with the best graph coloring algorithm has always been very challenging. However, university timetable problem can be formulated as a where courses are represented vertices and presence of common students or teachers corresponding edges. After that, stands to color lowest possible colors. In order accomplish this task, paper presents comparative study use in scheduling, five algorithms were used: First Fit, Welsh Powell, Largest Degree Ordering, Incidence DSATUR. We have taken Military Institute Science Technology, Bangladesh test case. The results show that Welsh-Powell DSATUR most effective generating optimal schedules. also provides insights into limitations advantages using suggests directions for future research these algorithms.